#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL num[70];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n;cin>>n;
      for(LL i=1;i<=n;i++) cin>>a[i];
      memset(num,0,sizeof(num));
      for(LL i=0;i<=60;i++){
         for(LL j=1;j<=n;j++){
            if(a[j]&(1LL<<i)){
               num[i]++;
            }
         }
      }
      bool flag=1;
      for(LL i=60;i>=0;i--){
          if(num[i]%2==0){
             continue;
          }
          else if(num[i]%4==1){
             flag=0;
             cout<<"WIN"<<"\n";
             break;
          }
          else if(num[i]%4==3){
             LL cnt=n-num[i];
             if(cnt%2==0){
                flag=0;
                cout<<"LOSE"<<"\n";
                break;
             }
             else if(cnt&1){
                flag=0;
                cout<<"WIN"<<"\n";
                break;
             }
          }
      }
      if(flag){
         cout<<"DRAW"<<"\n";
      }
   }
   return 0;
}
